perm filename META.XGP[S79,JMC]1 blob
sn#433652 filedate 1979-04-18 generic text, type T, neo UTF8
/LMAR=0/XLINE=3/FONT#0=BAXL30/FONT#1=BAXM30/FONT#2=BASB30/FONT#3=SUB/FONT#4=SUP/FONT#5=BASL35/FONT#6=NGR25/FONT#7=MATH30/FONT#8=FIX25/FONT#9=GRKB30
␈↓ α∧␈↓␈↓ u1
␈↓ α∧␈↓α␈↓ ∧6A PROGRAMME FOR META-EPISTEMOLOGY
␈↓ α∧␈↓␈↓ αTMeta-epistemology␈α
will␈α∞be␈α
to␈α∞epistemology␈α
as␈α
metamathematics␈α∞is␈α
to␈α∞mathematics.␈α
Taking
␈↓ α∧␈↓epistemology␈α
as␈α
the␈α
theory␈α
of␈α
knowledge␈αand␈α
how␈α
it␈α
is␈α
obtained,␈α
meta-epistemology␈αstudies␈α
systems
␈↓ α∧␈↓that␈α∂seek␈α⊂knowledge␈α∂in␈α⊂a␈α∂world.␈α∂ An␈α⊂epistemological␈α∂system␈α⊂is␈α∂then␈α∂a␈α⊂world␈α∂and␈α⊂a␈α∂knowledge
␈↓ α∧␈↓seeker in that world.
␈↓ α∧␈↓␈↓ αTOur␈αultimate␈α
goal␈αis␈α
to␈αstudy␈α
epistemological␈αsystems␈α
technically.␈α Thus␈α
we␈αmay␈α
consider␈αa
␈↓ α∧␈↓knowledge␈α⊃seeking␈α⊂computer␈α⊃program␈α⊂connected␈α⊃to␈α⊂a␈α⊃system␈α⊂of␈α⊃finite␈α⊂state␈α⊃automata␈α⊃and␈α⊂ask
␈↓ α∧␈↓whether␈α
a␈α
given␈α
knowledge␈αseeking␈α
strategy␈α
can␈α
learn␈α
certain␈αfacts␈α
about␈α
the␈α
"external␈αworld".␈α
To
␈↓ α∧␈↓the␈αextent␈αthat␈αepistemological␈αquestions␈αcan␈αbe␈αput␈αin␈αsuch␈αa␈αtechnical␈αform,␈αtheir␈αanswers␈αare␈αto
␈↓ α∧␈↓be␈α∂obtained␈α∂by␈α∞mathematics.␈α∂ The␈α∂philosophical␈α∞issues␈α∂will␈α∂then␈α∞concern␈α∂whether␈α∂the␈α∞technical
␈↓ α∧␈↓form␈αof␈αthe␈αquestion␈αproperly␈αrepresents␈αthe␈αoriginal␈αphilosophical␈αproblem.␈α If␈αthe␈αexperience␈αof
␈↓ α∧␈↓metamathematics␈α⊃is␈α⊃a␈α∩portent,␈α⊃the␈α⊃mathematical␈α⊃answers␈α∩won't␈α⊃be␈α⊃accepted␈α∩as␈α⊃philosophically
␈↓ α∧␈↓conclusive␈α∀but␈α∀will␈α∀nevertheless␈α∀transform␈α∀the␈α∀way␈α∀in␈α∀which␈α∀philosophers␈α∀think␈α∀about␈α∪the
␈↓ α∧␈↓problems.␈α I␈αhave␈α
in␈αmind␈αGoedel's␈αincompleteness␈α
theorems,␈αGentzen's␈αresults␈αon␈α
the␈αconsistency
␈↓ α∧␈↓of arithmetic and the result that intuitionist and classical arithmetic are equiconsistent.
␈↓ α∧␈↓␈↓ αTI␈αmust␈αconfess␈αthat␈αI␈αcannot␈αyet␈αgive␈αtechnical␈αforms␈αof␈αepistemological␈αquestions␈αthat␈αseem
␈↓ α∧␈↓ripe for mathematical attack. However, I have some ideas that may be helpful.
␈↓ α∧␈↓1.␈αAvoiding␈αheuristic␈αproblems.␈α Work␈αin␈αartificial␈αintelligence␈αsuggests␈αthat␈αfind␈αout␈αthe␈α
facts␈αof
␈↓ α∧␈↓the␈α∂world␈α∞has␈α∂two␈α∞components.␈α∂ One␈α∂component␈α∞is␈α∂a␈α∞general␈α∂framework␈α∞or␈α∂language␈α∂in␈α∞which
␈↓ α∧␈↓hypotheses␈αand␈αfacts␈α
can␈αbe␈αexpressed,␈α
and␈αthe␈αother␈α
is␈αa␈αstrategy␈α
of␈αsearch␈αand␈α
experiment.␈α In
␈↓ α∧␈↓artificial intelligence, the first is called epistemology, and the second is called heuristics.
␈↓ α∧␈↓␈↓ αTIt␈α∞is␈α∞our␈α
hope␈α∞that␈α∞the␈α
heuristic␈α∞problem␈α∞can␈α
be␈α∞avoided␈α∞in␈α
studying␈α∞epistemology␈α∞in␈α
the
␈↓ α∧␈↓following␈α∂way.␈α∂ Instead␈α∂of␈α∂imagining␈α∂a␈α∂computer␈α∂program␈α∂that␈α∂seeks␈α∂knowledge,␈α∂we␈α∂imagine␈α∂a
␈↓ α∧␈↓program␈α
that␈αis␈α
led␈αtowards␈α
the␈α
truth␈αby␈α
a␈αSocratic␈α
tutor.␈α
Its␈αtutor␈α
supplies␈αno␈α
knowledge␈α
to␈αbe
␈↓ α∧␈↓accepted␈α∞on␈α∞the␈α∞tutor's␈α∞authority,␈α∞but␈α∞merely␈α∞proposes␈α∞observations,␈α∞experiments␈α∞and␈α∞inferences.
␈↓ α∧␈↓The␈α⊃student␈α⊃program␈α⊃accepts␈α⊃or␈α⊃rejects␈α⊃these␈α⊃steps␈α⊃according␈α⊃to␈α⊃its␈α⊃built-in␈α⊃epistemology,␈α⊃i.e.
␈↓ α∧␈↓knowledge,␈αrules␈αof␈αinference,␈αand␈αrules␈αof␈αreasonable␈αconjecture.␈α We␈αrequire␈αthat␈αthe␈αstudent␈αbe
␈↓ α∧␈↓consistent␈αin␈αthat␈α
no␈αSocrates␈αcan␈α
lead␈αit␈αinto␈αa␈α
contradiction.␈α (Later␈αwe␈α
shall␈αhave␈αto␈α
relax␈αthis
␈↓ α∧␈↓stricture␈αa␈α
little).␈α If␈αthe␈α
Socratic␈αtutor␈α
can␈αlead␈αit␈α
to␈αdiscover␈α
a␈αcertain␈αfact␈α
about␈αits␈α
world,␈αthen
␈↓ α∧␈↓we␈αshall␈αsay␈αthat␈α
its␈αepistemology␈αis␈αadequate␈α
for␈αobtaining␈αthis␈αfact.␈α
Since␈αwe,␈αthe␈αcreators␈αof␈α
the
␈↓ α∧␈↓epistemological␈α∞system,␈α
also␈α∞created␈α
the␈α∞world␈α∞in␈α
which␈α∞knowledge␈α
is␈α∞sought,␈α
we␈α∞know␈α∞what␈α
the
␈↓ α∧␈↓facts are, so it is a definite question as to whether the program has discovered them.
␈↓ α∧␈↓␈↓ αTWe␈αmust␈αhope␈αthat␈αavoiding␈αheuristics␈αis␈αsuccessful,␈αbecause␈αstudying␈αsystems␈αthat␈αcombine
␈↓ α∧␈↓epistemology and heuristics will be very difficult.
␈↓ α∧␈↓␈↓ αTConsider␈α
first␈αKant's␈α
idea␈αthat␈α
our␈αability␈α
to␈α
understand␈αthe␈α
world␈αdepends␈α
on␈αhaving␈α
some
␈↓ α∧␈↓innate␈α
ideas.␈α Many␈α
of␈αhis␈α
original␈αproposals␈α
as␈α
to␈αwhat␈α
modes␈αof␈α
perceiving␈αthe␈α
world␈αare␈α
innate,
␈↓ α∧␈↓e.g.␈αEuclidean␈αgeometry,␈αhaven't␈αsurvived␈αintact,␈αand␈αothers␈αare␈αinsufficiently␈αdefinitely␈αdescribed,
␈↓ α∧␈↓but␈α
something␈α
along␈α
this␈α∞line␈α
is␈α
still␈α
defended.␈α
Here␈α∞is␈α
an␈α
attempt␈α
at␈α
a␈α∞corresponding␈α
technical
␈↓ α∧␈↓question.
␈↓ α∧␈↓␈↓ αTLet␈αthe␈α
world␈αbe␈αa␈α
system␈αwith␈αa␈α
state␈αthat␈α
varies␈αas␈αa␈α
function␈αof␈αa␈α
real␈αvariable␈α
␈↓↓t␈↓␈αcalled
␈↓ α∧␈↓time.␈α⊂ Let␈α⊂the␈α⊂"student"␈α⊂be␈α⊂computer␈α⊃program␈α⊂with␈α⊂sense␈α⊂and␈α⊂motor␈α⊂organs␈α⊂connected␈α⊃to␈α⊂this
␈↓ α∧␈↓␈↓ u2
␈↓ α∧␈↓"outside␈αworld".␈α We␈αsuppose␈αthat␈αthe␈αway␈αthe␈αstate␈αof␈αthe␈αoutside␈αworld␈αchanges␈αas␈αa␈αfunction␈αof
␈↓ α∧␈↓its␈α∞previous␈α∞history␈α∞and␈α∞its␈α∞motor␈α∞inputs␈α∂is␈α∞described␈α∞by␈α∞a␈α∞collection␈α∞of␈α∞sentences␈α∞of␈α∂set␈α∞theory.
␈↓ α∧␈↓Suppose␈α∂further␈α∂that␈α∞the␈α∂particular␈α∂"outside␈α∂world"␈α∞is␈α∂an␈α∂arbitrary␈α∂member␈α∞of␈α∂a␈α∂certain␈α∂set␈α∞of
␈↓ α∧␈↓"possible outside worlds" - this set also being defined by a sentence of set theory.
␈↓ α∧␈↓␈↓ αTNow␈α
we␈α
can␈α
try␈α∞to␈α
embody␈α
different␈α
epistemological␈α∞strategies␈α
in␈α
the␈α
student␈α∞program.␈α
A
␈↓ α∧␈↓rather␈α⊂strong␈α⊂empiricist␈α⊂strategy␈α⊂would␈α⊂allow␈α∂only␈α⊂hypotheses␈α⊂that␈α⊂were␈α⊂expressed␈α⊂in␈α⊂terms␈α∂of
␈↓ α∧␈↓sensory-motor␈αrelations␈αin␈αsome␈αrestricted␈αlanguage.␈α A␈αKantian␈αprogram␈αwould␈αallow␈αhypotheses
␈↓ α∧␈↓that␈α∂conformed␈α⊂to␈α∂some␈α∂preferred␈α⊂␈↓↓synthetic␈α∂a␈α⊂priori␈↓␈α∂ideas.␈α∂ It␈α⊂seems␈α∂to␈α∂me␈α⊂that␈α∂a␈α⊂set␈α∂theoretic
␈↓ α∧␈↓epistemology␈αcorresponding␈αto␈αmodern␈αscientific␈αpractice␈αwould␈αallow␈αthe␈αtutor␈αto␈αpropose␈αnew␈αset
␈↓ α∧␈↓theoretic␈α∂constants␈α∂without␈α∂having␈α∂to␈α∂define␈α∂them␈α∂and␈α∂propose␈α∂sentences␈α∂of␈α∂set␈α∂theory␈α⊂as␈α∂laws
␈↓ α∧␈↓connecting␈αthem.␈α
Depending␈αon␈αwhat␈α
was␈αproposed␈α
and␈αwhat␈αthe␈α
world␈αis␈α
like,␈αthe␈αstudent␈α
might
␈↓ α∧␈↓be␈α∞able␈α
to␈α∞decide␈α
on␈α∞these␈α
proposed␈α∞laws,␈α
but␈α∞no␈α
a␈α∞priori␈α
requirement␈α∞would␈α
be␈α∞made␈α∞that␈α
the
␈↓ α∧␈↓proposed laws be decidable experimentally.
␈↓ α∧␈↓␈↓ αTWe␈α∞should␈α∞compare␈α∞the␈α∂efficacy␈α∞of␈α∞many␈α∞specific␈α∂innate␈α∞modes␈α∞of␈α∞perception,␈α∂e.g.␈α∞spatial
␈↓ α∧␈↓and␈α
temporal,␈α
with␈α∞the␈α
general␈α
mode␈α
that␈α∞says␈α
that␈α
the␈α
world␈α∞is␈α
a␈α
causal␈α∞system␈α
mathematically
␈↓ α∧␈↓describable,␈αe.g.␈αby␈αsentences␈αof␈αZermelo-Fraenkel␈αset␈αtheory.␈α The␈αlatter␈αpresumably␈αhas␈αa␈αcertain
␈↓ α∧␈↓universality.␈α Any␈αspecific␈α
mode␈αof␈αperception,␈α
e.g.␈αthe␈αtendency␈α
to␈αinterpret␈αsensations␈α
as␈αarising
␈↓ α∧␈↓from␈α
persistent␈α
objects␈α
located␈α
in␈α
three-dimensional␈α
space,␈α
can␈α
be␈α
formulated␈α
as␈α
a␈α
hypothesis␈α
in
␈↓ α∧␈↓set theory.
␈↓ α∧␈↓␈↓ αTSystems␈α∞of␈α
the␈α∞type␈α
described␈α∞above␈α∞separate␈α
the␈α∞knower␈α
from␈α∞the␈α
outside␈α∞world.␈α∞ At␈α
the
␈↓ α∧␈↓cost␈α
of␈α
elaboration␈α∞that␈α
may␈α
make␈α
theorems␈α∞harder␈α
to␈α
formulate␈α
and␈α∞prove,␈α
we␈α
can␈α∞remove␈α
the
␈↓ α∧␈↓separation.␈α∂ Consider␈α∂a␈α∂two␈α∞or␈α∂three␈α∂dimensional␈α∂cellular␈α∞automaton␈α∂system.␈α∂ In␈α∂such␈α∂a␈α∞system,
␈↓ α∧␈↓each␈α
cell␈α
is␈α
a␈α∞finite␈α
automaton␈α
whose␈α
state␈α
at␈α∞time␈α
␈↓↓t+1␈↓␈α
depends␈α
on␈α
its␈α∞state␈α
and␈α
the␈α
states␈α∞of␈α
its
␈↓ α∧␈↓immediate␈αneighbors␈αat␈αtime␈α␈↓↓t.␈↓␈αA␈αgood␈αexample␈αis␈αConway's␈αLife␈αautomaton␈αthat␈αuses␈αan␈αinfinite
␈↓ α∧␈↓two␈αdimensional␈αarray␈αof␈αtwo␈αstate␈αautomata␈α-␈αone␈αlocated␈αat␈αeach␈αpoint␈αof␈αthe␈αplane␈αwith␈αinteger
␈↓ α∧␈↓co-ordinates.␈α
The␈αstate␈α
of␈αa␈α
cell␈αat␈α
time␈α␈↓↓t+1␈↓␈α
is␈α0␈α
if␈αthe␈α
number␈αof␈α
its␈αeight␈α
neigbors␈αin␈α
state␈αone␈α
is
␈↓ α∧␈↓less␈αthan␈α
2␈αor␈α
more␈αthan␈α3.␈α
If␈α2␈α
neighbors␈αare␈αin␈α
state␈α1,␈α
it␈αretains␈αits␈α
state␈αand␈α
if␈α3␈αneighbors␈α
are
␈↓ α∧␈↓in␈α∞state␈α
1,␈α∞it␈α∞goes␈α
to␈α∞state␈α∞1.␈α
It␈α∞has␈α
been␈α∞shown␈α∞that␈α
the␈α∞Life␈α∞cellular␈α
automaton␈α∞is␈α∞a␈α
universal
␈↓ α∧␈↓computer␈α∂and␈α∂constructor.␈α⊂ In␈α∂particular,␈α∂self-reproducing␈α∂arrays␈α⊂of␈α∂Life␈α∂cells␈α∂that␈α⊂can␈α∂execute
␈↓ α∧␈↓arbitrary␈α∪computer␈α∀programs␈α∪are␈α∪possible.␈α∀ We␈α∪can␈α∪imagine␈α∀equipping␈α∪such␈α∪an␈α∀array␈α∪with
␈↓ α∧␈↓different␈α
epistemological␈α
programs␈α
and␈α
ask␈α
what␈α
programs␈α
would␈α
do␈α
formulate␈α
and␈α
confirm␈α
the
␈↓ α∧␈↓hypothesis␈αthat␈αthe␈αfundamental␈αphysics␈αof␈αtheir␈αworld␈αwas␈αthe␈αLife␈αcellular␈αautomaton.␈α If␈αthere
␈↓ α∧␈↓were␈αmany␈αof␈αthem,␈αwhat␈αhypotheses␈αwould␈αthey␈αformulate␈αabout␈αother␈αminds,␈αconsciousness,␈αetc?
␈↓ α∧␈↓Would␈αthey␈αdiscriminate␈αproperly␈αbetween␈αtheir␈αprograms␈α(minds)␈αand␈αthe␈αconfigurations␈αof␈αcells
␈↓ α∧␈↓(brains)␈α⊗constituting␈α⊗the␈α↔computer␈α⊗executing␈α⊗the␈α⊗program?␈α↔ Indeed,␈α⊗is␈α⊗this␈α↔the␈α⊗interesting
␈↓ α∧␈↓distinction?